Fan-out enabled spin wave majority gate
نویسندگان
چکیده
منابع مشابه
Experimental prototype of a spin-wave majority gate
X iv :1 61 2. 07 70 8v 1 [ cs .E T ] 1 5 D ec 2 01 6 Experimental prototype of a spin-wave majority gate T. Fischer, 2, a) M. Kewenig, D. A. Bozhko, 2 A. A. Serga, I. I. Syvorotka, F. Ciubotaru, 5 C. Adelmann, B. Hillebrands, and A. V. Chumak Fachbereich Physik and Landesforschungszentrum OPTIMAS, Technische Universität Kaiserslautern, 67663 Kaiserslautern, Germany Graduate School Materials Sci...
متن کاملNon-volatile spin wave majority gate at the nanoscale
A spin wave majority fork-like structure with feature size of 40 nm, is presented and investigated, through micromagnetic simulations. The structure consists of three merging out-of-plane magnetization spin wave buses and four magneto-electric cells serving as three inputs and an output. The information of the logic signals is encoded in the phase of the transmitted spin waves and subsequently ...
متن کاملComputing majority with low-fan-in majority queries
In this paper we examine the problem of computing majority functionMAJn on n bits by depthtwo formula, where each gate is a majority function on at most k inputs. We present such formula that gives the first nontrivial upper bound for this problem, with k = 2 3n + 4. This answers an open question in [7]. We also look at this problem in adaptive setting — when we are allowed to query for value o...
متن کاملEnhanced Threshold Gate Fan-in Reduction Algorithms
The paper describes and improves on a Boolean neural network (NN) fan-in reduction algorithm, with a view to possible VLSI implementation of NNs using threshold gates (TGs). Constructive proofs are given for: (i) at least halving the size; (ii) reducing the depth from O(N) to O(logN). Lastly a fresh algorithm which reduces the size to polynomial is suggested.
متن کاملQuantum Fan-out is Powerful
We demonstrate that the unbounded fan-out gate is very powerful. Constantdepth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf ) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[t], and Counting. Classically, we need logarithmic depth even if we can use unbound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2020
ISSN: 2158-3226
DOI: 10.1063/1.5134690